A Proof-Theoretic Approach to Hierarchical Math Library Organization
نویسندگان
چکیده
The relationship between theorems and lemmas in mathematical reasoning is often vague. No system exists that formalizes the structure of theorems in a mathematical library. Nevertheless, the decisions we make in creating lemmas provide an inherent hierarchical structure to the statements we prove. In this paper, we develop a formal system that organizes theorems based on scope. Lemmas are simply theorems with a local scope. We develop a representation of proofs that captures scope and present a set of proof rules to create and reorganize the scopes of theorems and lemmas. The representation and rules allow systems for formalized mathematics to more accurately reflect the natural structure of mathematical knowledge.
منابع مشابه
Information Theoretic Approach to Geometric Programming
This paper shows how the fundamental geometric inequality lemma of geometric programming can be obtained immediately from information theoretic methods. This results in a drastic simplification of the proof and points the way to other connections between information theory and geometric programming
متن کاملCollapsing functions based on recursively large ordinals: A well-ordering proof for KPM
It is shown how the strong ordinal notation systems that figure in proof theory and have been previously defined by employing large cardinals, can be developed directly on the basis of their recursively large counterparts. Thereby we provide a completely new approach to well–ordering proofs as will be exemplified by determining the proof–theoretic ordinal of the system KPM of [R 91].
متن کاملAn ordinal analysis for theories of self-referential truth
The first attempt at a systematic approach to axiomatic theories of truth was undertaken by Friedman and Sheard [11]. There twelve principles consisting of axioms, axiom schemata and rules of inference, each embodying a reasonable property of truth were isolated for study. Working with a base theory of truth conservative over PA, Friedman and Sheard raised the following questions. Which subsets...
متن کاملHarrington's conservation theorem redone
Leo Harrington showed that the second-order theory of arithmetic WKL0 is Π 1 -conservative over the theory RCA0. Harrington’s proof is modeltheoretic, making use of a forcing argument. A purely proof-theoretic proof, avoiding forcing, has been eluding the efforts of researchers. In this short paper, we present a proof of Harrington’s result using a cut-elimination argument.
متن کاملGame-Theoretic Approach for Pricing Decisions in Dual-Channel Supply Chain
In the current study, a dual-channel supply chain is considered containing one manufacturer and two retailers. It is assumed that the manufacturer and retailers have the same decision powers. A game-theoretic approach is developed to analyze pricing decisions under the centralized and decentralized scenarios. First, the Nash model is established to obtain the equilibrium decisions in the decent...
متن کامل